On Ill-conditioned Eigenvalues, Multiple Roots of Polynomials, and Their Accurate Computations
نویسنده
چکیده
Algebraic eigenvalues with associated left and right eigenvectors (nearly) orthogonal, and polynomial roots that are multiple, have been known to be sensitive to perturbations in numerical computation and thereby ill-conditioned. By constructing an extended polynomial system, it is proved that, under certain conditions, traditionally deened ill-conditioned eigenvalues and polynomial roots can be remarkably stable and insensitive to perturbations, if they are computed as numerical multiple eigenvalues/roots. Furthermore, using the extended polynomial system which is easy to solve, those numerical multiple eigenvalues can be computed with high forward accuracy, while backward errors are estimated as by-products through auxiliary variables of the extended system.
منابع مشابه
Computing multiple roots of inexact polynomials
We present a combination of two novel algorithms that accurately calculate multiple roots of general polynomials. For a given multiplicity structure and initial root estimates, Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and calculates multiple roots simultaneously. To fulfill the input requirement of Algorithm I, we ...
متن کاملOn condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition numbers of eigenvalues and the pseudospectral growth rate. We obtain that if a simple eigenvalue of a matrix polynomial is ill-conditioned in some respects, th...
متن کاملOn condition numbers of polynomial eigenvalue problems with nonsingular leading coefficients
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition numbers of eigenvalues and the pseudospectral growth rate. We obtain that if a simple eigenvalue of a matrix polynomial is ill-conditioned in some respects, th...
متن کاملComplex-coefficient Polynomial Roots by a Stability Criterion
Computation of polynomial roots is a problem that arises in various domains of science and engineering, and has thus received much attention in years, with marked recent progress. This paper introduces a new numerical algorithm for computing the roots of a complex-coefficient polynomial of degree n. The method is based on bracketing, in the spirit of Lehmer-Schur [1], but uses a robust stabilit...
متن کاملRoots of Polynomials Expressed in Terms of Orthogonal Polynomials
A technique is presented for determining the roots of a polynomial p(x) that is expressed in terms of an expansion in orthogonal polynomials. The roots are expressed as the eigenvalues of a nonstandard companion matrix Bn whose coefficients depend on the recurrence formula for the orthogonal polynomials, and on the coefficients of the orthogonal expansion. Some questions on the numerical stabil...
متن کامل